Simultaneous Testing of Grouped Hypotheses: Finding Needles in Multiple Haystacks
نویسندگان
چکیده
منابع مشابه
Simultaneous Testing of Grouped Hypotheses: Finding Needles in Multiple Haystacks
In large-scale multiple testing problems, data are often collected from heterogeneous sources and hypotheses form into groups that exhibit different characteristics. Conventional approaches, including the pooled and separate analyses, fail to efficiently utilize the external grouping information. We develop a compound decision theoretic framework for testing grouped hypotheses and introduce an ...
متن کاملBrain microarray: finding needles in molecular haystacks.
Introduction When technical advances generated novel genetic markers in the 1980s, they were combined with linkage analysis allowing thousands of genes to be profiled simultaneously (Botstein et al., 1980; Weber and May, 1989). This capability has been used to isolate the molecular causes of most monogenetic disorders of the brain. With this success as a backdrop, the persistent difficulty in i...
متن کاملGroupTest: Multiple Testing Procedure for Grouped Hypotheses
In the modern Big Data analysis, testing multiple hypotheses simultaneously has been an important tool in analyzing data arising from scientific studies, such as genetics, astronomy, social sciences and many others. The hypotheses can often be grouped together according to the nature of the scientific investigations. For instance, genes can be grouped according to gene pathways; the nearby pixe...
متن کاملFinding semantic needles in haystacks of Web text and links∗
Content and links are used to search, rank, cluster and classify Web pages. Here I analyze and visualize similarity relationships in massive Web datasets to identify how content and link analysis should be integrated for relevance approximation. Human-generated metadata from Web directories is used to estimate semantic similarity. Highly heterogeneous topical maps point to a critical dependence...
متن کاملMemory-Efficient Algorithms for Finding Needles in Haystacks
One of the most common tasks in cryptography and cryptanalysis is to find some interesting event (a needle) in an exponentially large collection (haystack) of N=2^n possible events, or to demonstrate that no such event is likely to exist. In particular, we are interested in finding needles which are defined as events that happen with an unusually high probability of p>>1/N in a haystack which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2009
ISSN: 0162-1459,1537-274X
DOI: 10.1198/jasa.2009.tm08415